Trace identities and almost polynomial growth

نویسندگان

چکیده

In this paper we study algebras with trace and their polynomial identities over a field of characteristic 0. We consider two commutative matrix algebras: $D_2$, the algebra $2\times 2$ diagonal matrices $C_2$, $2 \times generated by $e_{11}+e_{22}$ $e_{12}$. describe all possible traces on these corresponding codimensions. Moreover characterize varieties growth finite dimensional algebra. As consequence, see that variety is either or exponential.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebras, Dialgebras, and Polynomial Identities *

This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras, and the corresponding dialgebras; the KP algorithm for converting identities for algebras into identities for dialgebras; the BSO algorithm for converting oper...

متن کامل

Polynomial identities for partitions

For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...

متن کامل

Interprocedurally Analyzing Polynomial Identities

Since programming languages are Turing complete, it is impossible to decide for all programs whether a given non-trivial semantic property is valid or not. The way-out chosen by abstract interpretation is to provide approximate methods which may fail to certify a program property on some programs. Precision of the analysis can be measured by providing classes of programs for which the analysis ...

متن کامل

Polynomial Identities for Hypermatrices

We develop an algorithm to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley–Hamilton theorem for hypermatrices.

متن کامل

How to Trace and Revise Identities

The Entity Name System (ENS) is a service aiming at providing globally unique URIs for all kinds of real-world entities such as persons, locations and products, based on descriptions of such entities. Because entity descriptions available to the ENS for deciding on entity identity—Do two entity descriptions refer to the same real-world entity?—are changing over time, the system has to revise it...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2021

ISSN: ['1873-1376', '0022-4049']

DOI: https://doi.org/10.1016/j.jpaa.2020.106501